package com.spirng.leetcode.day10;

public class Test746 {
    public static void main(String[] args) {
        Test746 test746 = new Test746();
        test746.minCostClimbingStairs(new int[]{0,2,2,1});
    }
    public int minCostClimbingStairs(int[] cost) {
           int [] dp=new int[cost.length+1];
           dp[0]=0;
           dp[1]=0;
        for (int i = 2; i < dp.length; i++) {
            dp[i]=Math.min(dp[i-1] + cost[i-1],dp[i-2] + cost[i-2]);
        }
        return dp[cost.length];
    }
}
